Multiple Trusted Authorities in Identifier Based Cryptography from Pairings on Elliptic Curves

نویسندگان

  • Liqun Chen
  • Keith Harrison
چکیده

identifier based cryptography, multiple trusted authority, pairings We investigate a number of issues related to a key generation service in identifier based cryptographic technology. In particular, we focus on how to make this service more trustworthy. Our solution is the use of multiple trusted authorities in identifier based cryptography (MTAIBC), where these trusted authorities work together to issue a private key based on one or more given identifiers. However, to do this, these trusted authorities do not need to communicate with each other to establish a shared secret; and the users can freely choose a number of trusted authorities for their application purposes, which is not dependent on whether or not those trusted authorities have an agreement to work together. In the document, we give seven algorithms, each for a specific construct of the trusted authorities, and we also introduce a few examples of possible applications that can be implemented by using these algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Identity Based Signature Schemes Based on Pairings

We develop an eecient identity based signature scheme based on pairings whose security relies on the hardness of the Diie-Hellman problem in the random oracle model. We describe how this scheme is obtained as a special version of a more general generic scheme which yields further new provably secure identity based signature schemes if pairings are used. The generic scheme also includes traditio...

متن کامل

Multi-authority Electronic Voting Scheme Based on Elliptic Curves

In this paper, a new multi authority electronic voting scheme based on elliptic curves is proposed. According to the proposed scheme, each voter casts the vote as a point on the elliptic curve and the final tally is computed with the assistance of multiple authorities. A trusted center is involved in the scheme to distribute the shared secret key among the authorities and the Shamir (t, n) thre...

متن کامل

On Efficient Pairings on Elliptic Curves over Extension Fields

In implementation of elliptic curve cryptography, three kinds of finite fields have been widely studied, i.e. prime field, binary field and optimal extension field. In pairing-based cryptography, however, pairingfriendly curves are usually chosen among ordinary curves over prime fields and supersingular curves over extension fields with small characteristics. In this paper, we study pairings on...

متن کامل

Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC

Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...

متن کامل

A secure multicast protocol based on pairings on elliptic curves

The aim of this paper is to introduce a protocol for multicast distribution of secrets providing perfect forward and backward secrecy. The protocol is based on pairings on elliptic curves and has low cost communications and key storage. It is shown how this protocol improves some alternatives existing for real time communications. Keywords—Information security, multicast communications, ellipti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003